Eigenvector statistics of sparse random matrices
نویسندگان
چکیده
منابع مشابه
Eigenvector Statistics of Sparse Random Matrices
We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of ErdősRényi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the graphs. Our methodology follows [6] by analyzing the eigenvector flow under Dyson Brownian motion, combining with an isotropic local law for Green’s function. As an...
متن کاملEigenvector statistics of the product of Ginibre matrices.
We develop a method to calculate left-right eigenvector correlations of the product of m independent N×N complex Ginibre matrices. For illustration, we present explicit analytical results for the vector overlap for a couple of examples for small m and N. We conjecture that the integrated overlap between left and right eigenvectors is given by the formula O=1+(m/2)(N-1) and support this conjectu...
متن کاملSpectra of sparse random matrices
We compute the spectral density for ensembles of of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of the one suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaus...
متن کاملSparse Recovery Using Sparse Random Matrices
Over the recent years, a new *linear* method for compressing high-dimensional data (e.g., images) has been discovered. For any high-dimensional vector x, its *sketch* is equal to Ax, where A is an m x n matrix (possibly chosen at random). Although typically the sketch length m is much smaller than the number of dimensions n, the sketch contains enough information to recover an *approximation* t...
متن کاملSpectral radii of sparse random matrices
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Rényi graphs. For the Erdős-Rényi graph G(n, d/n), our results imply that the smallest and second-largest eigenvalues of the adjacency matrix converge to the edges of the support of the asymptotic eigenvalue distribution provided that d log n. Toget...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2017
ISSN: 1083-6489
DOI: 10.1214/17-ejp81